Nearest prototype classification of noisy data
نویسندگان
چکیده
منابع مشابه
Soft nearest prototype classification
We propose a new method for the construction of nearest prototype classifiers which is based on a Gaussian mixture ansatz and which can be interpreted as an annealed version of learning vector quantization (LVQ). The algorithm performs a gradient descent on a cost-function minimizing the classification error on the training set. We investigate the properties of the algorithm and assess its perf...
متن کاملPROTOTYPE GENERATION FOR NEAREST NEIGHBOR CLASSIFICATION: SURVEY OF METHODS 1 Prototype Generation for Nearest Neighbor Classification: Survey of Methods
Prototype generation techniques have arisen as very competitive methods for enhancing the nearest neighbor classifier through data reduction. A great number of methods tackling the prototype generation problem have been proposed in the literature. This technical report provides a survey of the most representative algorithms developed so far. A previously proposed categorization has been used to...
متن کاملDiscriminative Learning of the Prototype Set for Nearest Neighbor Classification
The nearest neighbor rule is one of the most widely used models for classification and selecting a compact set of prototype instances is an important problem for its applications. Many existing approaches on the prototype selection problem rely on instance-based analyses and local criteria on the class distribution, which are intractable for numerical optimization techniques. In this paper, we ...
متن کاملEPRENNID: An evolutionary prototype reduction based ensemble for nearest neighbor classification of imbalanced data
Classification problems with an imbalanced class distribution have received an increased amount of attention within the machine learning community over the last decade. They are encountered in a growing number of real-world situations and pose a challenge to standard machine learning techniques. We propose a new hybrid method specifically tailored to handle class imbalance, called EPRENNID. It ...
متن کاملDecision boundary preserving prototype selection for nearest neighbor classification
The excessive computational resources required by the Nearest Neighbor rule are a major concern for a number of specialists and practitioners in the Pattern Recognition community. Many proposals for decreasing this computational burden, through reduction of the training sample size, have been published. This paper introduces an algorithm to reduce the training sample size while preserving the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence Review
سال: 2008
ISSN: 0269-2821,1573-7462
DOI: 10.1007/s10462-009-9116-7